Independence Structures in Set Theory1
نویسنده
چکیده
The axioms for "independent choices" presented in van Lambalgen [1992] are strengthened here, so that they can be seen as introducing a new type of indiscernibles in set theory. The resulting system allows for the construction of natural inner models. The article is organised as follows. Section 1 introduces the axioms, some preliminary lemmas are proved and the relation with the axiom of choice is investigated. Section 0 gives a philosophical motivation for the axioms; the reader who is not interested in such matters can skip this part. In section 2 we compare the structure introduced by the axioms, here called an independence structure, with two constructions from model theory, indiscernibles and minimal sets. Section 3 contains the construction of inner models, while section 4 presents some concluding philosophical remarks.
منابع مشابه
INDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملMixed Roman domination and 2-independence in trees
Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacentor incident to at least one element $yin Vcup E$ for which $f(y)=2$. The weight of anMRDF $f$ is $sum _{xin Vcup E} f(x)$. The mi...
متن کاملTotal graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
متن کاملConstructibility and decidability versus domain independence and absoluteness
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and domain independence of queries in database theory. Our framework and results suggest that domain-independence and absoluteness might be the key notions in a general theory of constructibility, predicativity, and comput...
متن کامل